Visibility-Based Pursuit-Evasion: The Case of Curved Environments
نویسندگان
چکیده
منابع مشابه
Visibility-Based Pursuit-Evasion in Three-Dimensional Environments
The problem of visibility-based pursuit-evasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of the problem, including curved environments[11]; pursuers equipped with one or two “flashlights”, or rays of visibility[...
متن کاملVisibility-Based Pursuit-Evasion with Bounded Speed
This paper presents an algorithm for a visibility-based pursuit-evasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simply-connected polygonal environment, and the evader in turn tries actively to avoid detection. The algorithm is at least as powerful as the complete algorithm for the unbounded speed case, and with ...
متن کاملBenjamín Tovar and Steven M . LaValle Evasion with Bounded Speed − −
In this paper we present a study on the visibility-based pursuit– evasion problem in which bounds on the speeds of the pursuer and evader are given. In this setting, the pursuer tries to find the evader inside a simply connected polygonal environment, and the evader in turn tries to avoid detection. The focus of the paper is to develop a characterization of the set of possible evader positions ...
متن کاملVisibility Graphs, Dismantlability, and the Cops and Robbers Game
We study versions of cop and robber pursuit-evasion games on the visibility graphs of polygons, and inside polygons with straight and curved sides. Each player has full information about the other player’s location, players take turns, and the robber is captured when the cop arrives at the same point as the robber. In visibility graphs we show the cop can always win because visibility graphs ar...
متن کاملGap Navigation Trees: Minimal Representation for Visibility-based Tasks
In this paper we present our advances in a data structure, the Gap Navigation Tree (GNT), useful for solving different visibility-based robotic tasks in unknown planar environments. We present its use for optimal robot navigation in simply-connected environments, locally optimal navigation in multiply-connected environments, pursuit-evasion, and robot localization. The guiding philosophy of thi...
متن کامل